Linear approximation - PDFSEARCH.IO - Document Search Engine

Linear approximation
Results: 300

#	Item
131	Efficient Rank-one Residue Approximation Method for Graph Regularized Non-negative Matrix Factorization Qing Liao, Qian Zhang Department of Computer Science and Engineering The Hong Kong University of Science and Technol Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2014-01-05 09:06:34 Matrix theory Multivariate statistics Non-negative matrix factorization Singular value decomposition Singular value Matrix Algebra Linear algebra Mathematics
132	Regularized Laplacian Estimation and Fast Eigenvector Approximation Patrick O. Perry Information, Operations, and Management Sciences NYU Stern School of Business Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-14 01:08:22 Linear algebra Matrix theory Differential operators Algebraic graph theory Laplacian matrix matrices Laplace operator Eigenvalues and eigenvectors Tikhonov regularization Algebra Mathematics Mathematical analysis
133	Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure Add to Reading List Source URL: thibaut.horel.org Language: English - Date: 2015-01-22 00:44:30 Approximation algorithms Submodular set function Time complexity Linear programming relaxation Polynomial-time approximation scheme Linear programming Randomized rounding Normal distribution Linear regression Theoretical computer science Applied mathematics Computational complexity theory
134	Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-05-21 20:27:46 Linear algebra NP-complete problems Matrix theory Computational complexity theory Graph partition Approximation algorithm Algorithm Graph theory Eigenvalues and eigenvectors Mathematics Algebra Theoretical computer science
135	Nystr¨ om Approximation for Large-Scale Determinantal Processes Raja Hafiz Affandi University of Pennsylvania Add to Reading List Source URL: www.stat.washington.edu Language: English - Date: 2013-04-11 14:39:30 Matrix theory Eigenvalues and eigenvectors Spectrum Eigendecomposition of a matrix Determinantal point process Singular value decomposition Determinant Matrix Vector space Algebra Mathematics Linear algebra
136	Journal of Machine Learning Research3472 Submitted 7/12; PublishedFast Approximation of Matrix Coherence and Statistical Leverage Petros Drineas Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2013-01-07 18:40:32 Numerical linear algebra Matrix theory Functional analysis Matrices Orthogonal matrix Matrix Singular value decomposition Randomized algorithm QR decomposition Algebra Linear algebra Mathematics
137	Fast approximation of matrix coherence and statistical leverage Petros Drineas Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NYUSA Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-14 00:18:31 Numerical linear algebra Matrix theory Matrices Computational complexity theory Singular value decomposition Orthogonal matrix Matrix multiplication Randomized algorithm Low-rank approximation Algebra Linear algebra Mathematics
138	Finite sample approximation results for principal component analysis: a matrix perturbation approach Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2009-01-06 09:59:49 Data analysis Multivariate statistics Matrix theory Singular value decomposition Principal component analysis Eigenvalues and eigenvectors Covariance matrix Multivariate normal distribution Normal distribution Statistics Algebra Linear algebra
139	Factorized Diffusion Map Approximation Saeed Amizadeh Intelligent Systems Program University of Pittsburgh Pittsburgh, PA 15213 Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2015-01-06 16:24:34 Multivariate statistics Singular value decomposition Linear algebra Matrix theory Data analysis Laplace operator Principal component analysis Eigenvalues and eigenvectors Normal distribution Algebra Mathematics Statistics
140	Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu Add to Reading List Source URL: gki.informatik.uni-freiburg.de Language: English - Date: 2010-05-29 10:18:47 Combinatorial optimization Mathematics Applied mathematics Heuristic function Admissible heuristic Heuristic Branch and bound Linear programming relaxation Relaxation Mathematical optimization Heuristics Operations research

UPDATE